Method to extend the range of rice parameter for residual coding in transform skip mode

ABSTRACT

A method, computer program, and computer system is provided for video coding. Video data comprising a reference frame and residual blocks is received. Transform coefficients associated with the residual blocks are identified. The video data corresponding to the one or more residual blocks is encoded based on an extended dynamic range associated with the transform coefficients.

CROSS-REFERENCE TO RELATED APPLICATION

This application is a Continuation Application of U.S. application Ser. No. 17/028,349, filed on Sep. 22, 2020, which claims priority based on U.S. Provisional Application Nos. 62/904,642 (filed Sep. 23, 2019) and 62/954,277 (filed Dec. 27, 2019), the disclosures of which are incorporated in their entireties.

FIELD

This disclosure relates generally to field of data processing, and more particularly to video coding.

BACKGROUND

ITU-T VCEG (Q6/16) and ISO/IEC MPEG (JTC 1/SC 29/WG 11) published the H.265/HEVC (High Efficiency Video Coding) standard in 2013 (version 1) 2014 (version 2) 2015 (version 3) and 2016 (version 4). In 2015, these two standard organizations jointly formed the JVET (Joint Video Exploration Team) to explore the potential of developing the next video coding standard beyond HEVC In October 2017, they issued the Joint Call for Proposals on Video Compression with Capability beyond HEVC (CfP). By Feb. 15, 2018, a total of 22 CfP responses on standard dynamic range (SDR), 12 CfP responses on high dynamic range (HDR), and 12 CfP responses on 360 video categories were submitted, respectively. In April 2018, all received CfP responses were evaluated in the 122 MPEG/10th JVET meeting. As a result of this meeting, JVET formally launched the standardization process of next-generation video coding beyond HEVC. The new standard was named Versatile Video Coding (VVC), and JVET was renamed as Joint Video Expert Team.

SUMMARY

Embodiments relate to a method, system, and computer readable medium for video coding. According to one aspect, a method for video coding is provided. The method may include receiving video data comprising a reference frame and residual blocks. Transform coefficients associated with the residual blocks are identified. The video data corresponding to the one or more residual blocks is encoded based on an extended dynamic range associated with the transform coefficients.

According to another aspect, a computer system for video coding is provided. The computer system may include one or more processors, one or more computer-readable memories, one or more computer-readable tangible storage devices, and program instructions stored on at least one of the one or more storage devices for execution by at least one of the one or more processors via at least one of the one or more memories, whereby the computer system is capable of performing a method. The method may include receiving video data comprising a reference frame and residual blocks. Transform coefficients associated with the residual blocks are identified. The video data corresponding to the one or more residual blocks is encoded based on an extended dynamic range associated with the transform coefficients.

According to yet another aspect, a computer readable medium for video coding is provided. The computer readable medium may include one or more computer-readable storage devices and program instructions stored on at least one of the one or more tangible storage devices, the program instructions executable by a processor. The program instructions are executable by a processor for performing a method that may accordingly include receiving video data comprising a reference frame and residual blocks. Transform coefficients associated with the residual blocks are identified. The video data corresponding to the one or more residual blocks is encoded based on an extended dynamic range associated with the transform coefficients.

BRIEF DESCRIPTION OF THE DRAWINGS

These and other objects, features and advantages will become apparent from the following detailed description of illustrative embodiments, which is to be read in connection with the accompanying drawings. The various features of the drawings are not to scale as the illustrations are for clarity in facilitating the understanding of one skilled in the art in conjunction with the detailed description. In the drawings:

FIG. 1 illustrates a networked computer environment according to at least one embodiment;

FIGS. 2A-2C are exemplary block diagrams of a transform skip encoding system for video coding, according to at least one embodiment;

FIG. 3 is an exemplary Rice parameter computation system, according to at least one embodiment;

FIG. 4 is an operational flowchart illustrating the steps carried out by a program for video coding, according to at least one embodiment;

FIG. 5 is a block diagram of internal and external components of computers and servers depicted in FIG. 1 according to at least one embodiment;

FIG. 6 is a block diagram of an illustrative cloud computing environment including the computer system depicted in FIG. 1 , according to at least one embodiment; and

FIG. 7 is a block diagram of functional layers of the illustrative cloud computing environment of FIG. 6 , according to at least one embodiment.

DETAILED DESCRIPTION

Detailed embodiments of the claimed structures and methods are disclosed herein; however, it can be understood that the disclosed embodiments are merely illustrative of the claimed structures and methods that may be embodied in various forms. Those structures and methods may, however, be embodied in many different forms and should not be construed as limited to the exemplary embodiments set forth herein. Rather, these exemplary embodiments are provided so that this disclosure will be thorough and complete and will fully convey the scope to those skilled in the art. In the description, details of well-known features and techniques may be omitted to avoid unnecessarily obscuring the presented embodiments.

Embodiments relate generally to the field of data processing, and more particularly to media processing. The following described exemplary embodiments provide a system, method and computer program to, among other things, allow for a greater range of Rice parameters when encoding and decoding videos using residual coding with or without transform skip. Therefore, some embodiments have the capacity to improve the field of computing by allowing for higher throughput during video encoding and decoding.

As previously described, ITU-T VCEG (Q6/16) and ISO/IEC MPEG (JTC 1/SC 29/WG 11) published the H.265/HEVC (High Efficiency Video Coding) standard in 2013 (version 1) 2014 (version 2) 2015 (version 3) and 2016 (version 4). In 2015, these two standard organizations jointly formed the JVET (Joint Video Exploration Team) to explore the potential of developing the next video coding standard beyond HEVC In October 2017, they issued the Joint Call for Proposals on Video Compression with Capability beyond HEVC (CfP). By Feb. 15, 2018, a total of 22 OP responses on standard dynamic range (SDR), 12 OP responses on high dynamic range (HDR), and 12 CfP responses on 360 video categories were submitted, respectively. In April 2018, all received CfP responses were evaluated in the 122 MPEG/10th JVET meeting. As a result of this meeting, JVET formally launched the standardization process of next-generation video coding beyond HEVC. The new standard was named Versatile Video Coding (VVC), and JVET was renamed as Joint Video Expert Team. In VVC, a block of pixels can be entropy-coded in a spatial domain or in a transform domain. However, there exists a maximum number of context-coded bins per residual block in residual coding for transform coefficients. In regular mode, this number is 2 bins per transform coefficient with transform skip and 1.75 bins per transform coefficient without transform skip. It may be advantageous, therefore, to improve coding efficiency at lower quantization parameters by extending the range of the Rice parameter for encoding of residual sub-blocks with the transform skip by keeping the number of context-coded bins in residual coding of the transform coefficient to 1.75 in cases with and without transform coefficients in order to improve throughput without sacrificing coding efficiency.

Aspects are described herein with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer readable media according to the various embodiments. It will be understood that each block of the flowchart illustrations and/or block diagrams, and combinations of blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer readable program instructions.

The following described exemplary embodiments provide a system, method and computer program that allows for greater range and of Rice parameters for residual coding of video data with transform skip. Referring now to FIG. 1 , a functional block diagram of a networked computer environment illustrating a media processing system 100 (hereinafter “system”) for video coding. It should be appreciated that FIG. 1 provides only an illustration of one implementation and does not imply any limitations with regard to the environments in which different embodiments may be implemented. Many modifications to the depicted environments may be made based on design and implementation requirements.

The system 100 may include a computer 102 and a server computer 114. The computer 102 may communicate with the server computer 114 via a communication network 110 (hereinafter “network”). The computer 102 may include a processor 104 and a software program 108 that is stored on a data storage device 106 and is enabled to interface with a user and communicate with the server computer 114. As will be discussed below with reference to FIG. 5 the computer 102 may include internal components 800A and external components 900A, respectively, and the server computer 114 may include internal components 800B and external components 900B, respectively. The computer 102 may be, for example, a mobile device, a telephone, a personal digital assistant, a netbook, a laptop computer, a tablet computer, a desktop computer, or any type of computing devices capable of running a program, accessing a network, and accessing a database.

The server computer 114 may also operate in a cloud computing service model, such as Software as a Service (SaaS), Platform as a Service (PaaS), or Infrastructure as a Service (IaaS), as discussed below with respect to FIGS. 6 and 7 . The server computer 114 may also be located in a cloud computing deployment model, such as a private cloud, community cloud, public cloud, or hybrid cloud.

The server computer 114, which may be used for video coding is enabled to run an Transform Skip Encoding Program 116 (hereinafter “program”) that may interact with a database 112. The Transform Skip Encoding Program method is explained in more detail below with respect to FIG. 4 . In one embodiment, the computer 102 may operate as an input device including a user interface while the program 116 may run primarily on server computer 114. In an alternative embodiment, the program 116 may run primarily on one or more computers 102 while the server computer 114 may be used for processing and storage of data used by the program 116. It should be noted that the program 116 may be a standalone program or may be integrated into a larger transform skip encoding program.

It should be noted, however, that processing for the program 116 may, in some instances be shared amongst the computers 102 and the server computers 114 in any ratio. In another embodiment, the program 116 may operate on more than one computer, server computer, or some combination of computers and server computers, for example, a plurality of computers 102 communicating across the network 110 with a single server computer 114. In another embodiment, for example, the program 116 may operate on a plurality of server computers 114 communicating across the network 110 with a plurality of client computers. Alternatively, the program may operate on a network server communicating across the network with a server and a plurality of client computers.

The network 110 may include wired connections, wireless connections, fiber optic connections, or some combination thereof. In general, the network 110 can be any combination of connections and protocols that will support communications between the computer 102 and the server computer 114. The network 110 may include various types of networks, such as, for example, a local area network (LAN), a wide area network (WAN) such as the Internet, a telecommunication network such as the Public Switched Telephone Network (PSTN), a wireless network, a public switched network, a satellite network, a cellular network (e.g., a fifth generation (5G) network, a long-term evolution (LTE) network, a third generation (3G) network, a code division multiple access (CDMA) network, etc.), a public land mobile network (PLMN), a metropolitan area network (MAN), a private network, an ad hoc network, an intranet, a fiber optic-based network, or the like, and/or a combination of these or other types of networks.

The number and arrangement of devices and networks shown in FIG. 1 are provided as an example. In practice, there may be additional devices and/or networks, fewer devices and/or networks, different devices and/or networks, or differently arranged devices and/or networks than those shown in FIG. 1 . Furthermore, two or more devices shown in FIG. 1 may be implemented within a single device, or a single device shown in FIG. 1 may be implemented as multiple, distributed devices. Additionally, or alternatively, a set of devices (e.g., one or more devices) of system 100 may perform one or more functions described as being performed by another set of devices of system 100.

Referring now to FIG. 2A, an exemplary coding system 200A is depicted. The coding system 200A may include, among other things, summing modules 202A and 202B, an adjustment module 204A, clipping modules 206A and 206B, and lookup tables 208A and 208B. The coding system 200A may select cRiceParam as used in VTM-6.0. When transform skip is not activated, a local sum of a maximum of five neighboring absolute levels may be calculated by the summing module 202A to produce locSumAbs5. If a neighboring is outside the current transform unit, its absolute level may default to zero. locSumAbs5 may be modified by the adjustment unit 204A and clipped by the clipping module 206A to between 0 and 31 with baseLevel as input to produce locSumAbs as: locSumAbs=Clip3(0, 31, locSumAbs5−baseLevel*5). locSumAbs may be used as input to the lookup table 208A to determine the rice parameter cRiceParam when there is no transform skip.

When transform skip is activated, the summing module 202B may calculate a local sum of a maximum of two neighboring absolute levels to produce locSumAbs2. If a neighbor is outside the current transform unit, its absolute level may default to zero. locSumAbs2 may be clipped to between 0 and 31 by the clipping module 206B to produce locSumAbs as: locSumAbs=Clip3(0, 31, locSumAbs2). The locSumAbs is used as input to the lookup table 208B to determine the rice parameter cRiceParam when there is transform skip.

Referring now to FIG. 2B, an exemplary coding system 200B is depicted. The coding system 200B may include, among other things, summing modules 202C and 202D, adjustment modules 204C and 204D, clipping modules 206C and 206D, and a lookup table 208C. The coding system 200B may extend the range of the Rice parameter in the residual coding with transform skip mode. When transform skip is not activated, a local sum of a maximum of five neighboring absolute levels may be calculated by the summing module 202C to produce locSumAbs5. locSumAbs5 may be modified by the adjustment module 204C and clipped by the clipping module 206C to between 0 and 31 with baseLevel as input to produce locSumAbs as: locSumAbs=Clip3(0, 31, locSumAbs5−baseLevel*5). locSumAbs may be used as an input to the lookup table 208C to determine the rice parameter cRiceParam when there is no transform skip.

When transform skip is activated, the summing module 202D may calculate a local sum of a maximum of two neighboring absolute levels to produce locSumAbs2. locSumAbs2 may be modified by the adjustment module 204D and clipped by the clipping module 206D to between 0 and 31 to produce locSumAbs as: locSumAbs=Clip3(0, 31, (locSumAbs2>>1)+1). locSumAbs may be used as input to the look up table 208C to determine the rice parameter cRiceParam when there is transform skip. By using the same lookup table, the dynamic range of cRiceParam with transform skip may be extended.

Referring now to FIG. 2C, an exemplary coding system 200C is depicted. The coding system 200C may include, among other things, summing modules 202E and 202F, adjustment modules 204E and 204F, clipping modules 206E and 206F, and lookup tables 208E and 208F. The coding system 200C may extend the dynamic range of the Rice parameter for transform skip to improve efficiency at lower QP (e.g., for encoding at 1.75 context coded bins per coefficient). When transform skip is not activated, a local sum of a maximum of five neighboring absolute levels may be calculated by the summing module 202E to produce locSumAbs5. locSumAbs5 may be modified by the adjustment module 204E and clipped by the clipping module 206E to between 0 and 31 with baseLevel as input to produce locSumAbs as: locSumAbs=Clip3(0, 31, locSumAbs5−baseLevel*5). locSumAbs may be used as input to the lookup table 308E to determine the rice parameter cRiceParam when there is no transform skip.

When transform skip is activated, the summing module 202F may calculate a local sum of a maximum of two neighboring absolute levels to produce locSumAbs2. locSumAbs2 may be modified by the adjustment module 204F and clipped by the clipping module 206F to between 0 and N−1, for a predetermined positive integer N, to produce locSumAbs as: locSumAbs=Clip3(0, N−1, Adjusted2(locSumAbs2)), where the function Adjusted2(x) is a monotonic non-decreasing concave function of x. Then the variable locSumAbs may be used as input to the lookup table 208F having N entries, to determine the rice parameter cRiceParam. Because the lookup table 208F may have a higher dynamic range than the lookup table 208E, the dynamic range of cRiceParam with transform skip is extended. Referring now to FIG. 3 , an exemplary Rice parameter computation system 300 is depicted. In computing the Rice parameter, the branches and the lookup table may be removed in the derivation of the Rice parameter for transform domain abs_remainder[n] and dec_abs_level[n]. The computation of cRiceParam from the sum may be implemented as: cRiceParam=(sum>6)+(sum>13)+(sum>27), where the relational operator (>) may yield 1 if the relation is true and 0 if it is false.

According to one or more embodiments, a piecewise constant function ƒ(x) of x may be defined as: ƒ(x)=Σ_(i=0) ^(n)a_(i)χ_(i)(x)  (Eq. 1) for all real number x, and n≥1, and a_(i) are real numbers, and χ_(i) may be the indicator function:

$\begin{matrix} {{Χ_{i}(x)} = \left\{ \begin{matrix} 1 & {{{if}\alpha_{i - 1}} \leq x < \alpha_{i}} \\ 0 & {otherwise} \end{matrix} \right.} & \left( {{Eq}.2} \right) \end{matrix}$ $\begin{matrix} {{{{for}0} < i < N},{and}} &  \end{matrix}$ $\begin{matrix} {{Χ_{0}(x)} = \left\{ \begin{matrix} 1 & {{{if}x} < \alpha_{0}} \\ 0 & {otherwise} \end{matrix} \right.} & \left( {{Eq}.3} \right) \end{matrix}$ $\begin{matrix} {and} &  \end{matrix}$ $\begin{matrix} {{Χ_{n}(x)} = \left\{ {\begin{matrix} 1 & {{{if}x} \geq \alpha_{n - 1}} \\ 0 & {otherwise} \end{matrix}.} \right.} & \left( {{Eq}.4} \right) \end{matrix}$

The function ƒ(x) is implemented as ƒ(x)=β₀+Σ_(i=1) ^(n)β_(i) H _(a) _(i−1) (x)  (Eq. 5) where H_(a)(x) is the unit step function of x:

$\begin{matrix} {{H_{a}(x)} = \left\{ {\begin{matrix} 1 & {{{if}x} \geq \alpha} \\ 0 & {otherwise} \end{matrix},} \right.} & \left( {{Eq}.6} \right) \end{matrix}$ and β₀ =a ₀  (Eq. 7) β_(i) =a _(i) −a _(i-1)  (Eq. 8) The function H_(a)(x) is implemented as (x≥a) where the relational operator (≥) may yield 1 if the relation is true and 0 if it is false.

According to one or more embodiments, a piecewise constant function ƒ(x) of x defined as ƒ(x)=Σ_(i=0) ^(n) a _(i)χ_(i)(x)  (Eq. 9) for all integer number x, where n≥1, and a_(i) are integer numbers, and χ_(i) is the indicator function:

$\begin{matrix} {{Χ_{i}(x)} = \left\{ \begin{matrix} 1 & {{{if}\alpha_{i - 1}} \leq x < \alpha_{i}} \\ 0 & {otherwise} \end{matrix} \right.} & \left( {{Eq}.10} \right) \end{matrix}$ $\begin{matrix} {{{{for}0} < i < N},{and}} &  \end{matrix}$ $\begin{matrix} {{Χ_{0}(x)} = \left\{ \begin{matrix} 1 & {{{if}x} < \alpha_{0}} \\ 0 & {otherwise} \end{matrix} \right.} & \left( {{Eq}.11} \right) \end{matrix}$ $\begin{matrix} {and} &  \end{matrix}$ $\begin{matrix} {{Χ_{n}(x)} = \left\{ \begin{matrix} 1 & {{{if}x} \geq \alpha_{n - 1}} \\ 0 & {otherwise} \end{matrix} \right.} & \left( {{Eq}.12} \right) \end{matrix}$

The function ƒ(x) may be implemented as: ƒ(x)=β₀+Σ_(i=1) ^(n)β_(i) H _(a) _(i−1) (x)  (Eq. 13) where H_(a)(x) is the unit step function of x with integer a:

$\begin{matrix} {{H_{a}(x)} = \left\{ {\begin{matrix} 1 & {{{if}x} > \left( {\alpha - 1} \right)} \\ 0 & {otherwise} \end{matrix},} \right.} & \left( {{Eq}.14} \right) \end{matrix}$ and β₀=α₀  (Eq. 15) β_(i)=α_(i)−α_(i-1)  (Eq. 16)

The function H_(a)(x) is implemented as (x>(a−1)) where the relational operator (>) shall yield 1 if the relation is true and 0 if it is false. The function H_(a)(x) can also be implemented as (x≥a) where the relational operator (≥) shall yield 1 if the relation is true and 0 if it is false.

According to one or more embodiments, a piecewise constant function ƒ(x) of x defined as: ƒ(x)=Σ_(i=0) ^(n)α_(i)χ_(i)(x)  (Eq. 17) for all integer number x, where n≥1, and α_(i)=i, and χ_(i) is the indicator function:

$\begin{matrix} {{Χ_{i}(x)} = \left\{ \begin{matrix} 1 & {{{if}\alpha_{i - 1}} \leq x < \alpha_{i}} \\ 0 & {otherwise} \end{matrix} \right.} & \left( {{Eq}.18} \right) \end{matrix}$ $\begin{matrix} {{{{for}0} < i < N},{and}} &  \end{matrix}$ $\begin{matrix} {{Χ_{0}(x)} = \left\{ \begin{matrix} 1 & {{{if}x} < \alpha_{0}} \\ 0 & {otherwise} \end{matrix} \right.} & \left( {{Eq}.19} \right) \end{matrix}$ $\begin{matrix} {and} &  \end{matrix}$ $\begin{matrix} {{Χ_{n}(x)} = \left\{ \begin{matrix} 1 & {{{if}x} \geq \alpha_{n - 1}} \\ 0 & {otherwise} \end{matrix} \right.} & \left( {{Eq}.20} \right) \end{matrix}$

Since α_(i)=i, for i=0, . . . , n, β₀=α₀=0 and β_(i)=α_(i)−α_(i-1)=1  (Eq. 21) for i=1, n, the function ƒ(x) is implemented as: ƒ(x)=Σ_(i=1) ^(n) H _(a) _(i−1) (x)  (Eq. 22) where H_(a)(x) is the unit step function of x with integer a:

$\begin{matrix} {{H_{a}(x)} = \left\{ {\begin{matrix} 1 & {{{if}x} > \left( {\alpha - 1} \right)} \\ 0 & {otherwise} \end{matrix},} \right.} & \left( {{Eq}.23} \right) \end{matrix}$

The function H_(a)(x) is implemented as (x>(a−1)) where the relational operator (>) shall yield 1 if the relation is true and 0 if it is false, as defined in C and C++ programming language. The function H_(a)(x) can also be implemented as (x≥a) where the relational operator (≥) shall yield 1 if the relation is true and 0 if it is false, as defined in C and C++ programming language. There may be a special case may where the sum is x and ƒ(sum)=(sum>6)+(sum>13)+(sum>27)=cRiceParam.

Referring now to FIG. 4 , an operational flowchart 400 illustrating the steps carried out by a program for video coding is depicted. FIG. 4 may be described with the aid of FIGS. 1, 2A-2C, and 3 . As previously described, the Transform Skip Encoding Program 116 (FIG. 1 ) may allow for extended range of Rice Parameters used in residual coding of video data.

At 402, video data comprising a reference frame and residual blocks is received. The residual blocks may be used to represent a difference between a desired frame and the reference frame. The residual blocks may be used for variable length coding. In operation, the Transform Skip Encoding Program 116 (FIG. 1 ) on the server computer 114 (FIG. 1 ) may receive video data from the computer 102 (FIG. 1 ) over the communication network 110 (FIG. 1 ) or may retrieve the video data 204 from the database 112 (FIG. 1 ).

At 404, transform coefficients associated with the residual blocks are identified. The transform coefficients may be used for residual coding of the video data. In operation, the Transform Skip Encoding Program 116 (FIG. 1 ) on the server computer 114 (FIG. 1 ) may determine transform coefficients associated with the residual blocks from the received video data.

At 406, the video data corresponding to the one or more residual blocks is encoded based on an extended dynamic range associated with the transform coefficients. A maximum number of context-coded bins associated with the transform coefficient is 1.75 bins per transform coefficient whether transform skip is enabled or disabled. In operation, the transform skip selection module may determine whether transform skip is enabled or disabled. A sum of maximum values from neighboring residual blocks may be calculated by the summing module 202A (FIG. 2A). The sum may be adjusted by the adjustment module 204A (FIG. 2A) and clipped by the clipping module 206A (FIG. 2A). The lookup table 208A (FIG. 2A) may use the output of the clipping module 208A to determine a Rice parameter. The Transform Skip Encoding Program 116 (FIG. 1 ) may encode the video data using the Rice parameter and a maximum of 1.75 context-coded bins per transform coefficient.

It may be appreciated that FIG. 4 provides only an illustration of one implementation and does not imply any limitations with regard to how different embodiments may be implemented. Many modifications to the depicted environments may be made based on design and implementation requirements.

FIG. 5 is a block diagram 500 of internal and external components of computers depicted in FIG. 1 in accordance with an illustrative embodiment. It should be appreciated that FIG. 5 provides only an illustration of one implementation and does not imply any limitations with regard to the environments in which different embodiments may be implemented. Many modifications to the depicted environments may be made based on design and implementation requirements.

Computer 102 (FIG. 1 ) and server computer 114 (FIG. 1 ) may include respective sets of internal components 800A,B and external components 900A,B illustrated in FIG. 4 . Each of the sets of internal components 800 include one or more processors 820, one or more computer-readable RAMs 822 and one or more computer-readable ROMs 824 on one or more buses 826, one or more operating systems 828, and one or more computer-readable tangible storage devices 830.

Processor 820 is implemented in hardware, firmware, or a combination of hardware and software. Processor 820 is a central processing unit (CPU), a graphics processing unit (GPU), an accelerated processing unit (APU), a microprocessor, a microcontroller, a digital signal processor (DSP), a field-programmable gate array (FPGA), an application-specific integrated circuit (ASIC), or another type of processing component. In some implementations, processor 820 includes one or more processors capable of being programmed to perform a function. Bus 826 includes a component that permits communication among the internal components 800A,B.

The one or more operating systems 828, the software program 108 (FIG. 1 ) and the Transform Skip Encoding Program 116 (FIG. 1 ) on server computer 114 (FIG. 1 ) are stored on one or more of the respective computer-readable tangible storage devices 830 for execution by one or more of the respective processors 820 via one or more of the respective RAMS 822 (which typically include cache memory). In the embodiment illustrated in FIG. 5 , each of the computer-readable tangible storage devices 830 is a magnetic disk storage device of an internal hard drive. Alternatively, each of the computer-readable tangible storage devices 830 is a semiconductor storage device such as ROM 824, EPROM, flash memory, an optical disk, a magneto-optic disk, a solid state disk, a compact disc (CD), a digital versatile disc (DVD), a floppy disk, a cartridge, a magnetic tape, and/or another type of non-transitory computer-readable tangible storage device that can store a computer program and digital information.

Each set of internal components 800A,B also includes a R/W drive or interface 832 to read from and write to one or more portable computer-readable tangible storage devices 936 such as a CD-ROM, DVD, memory stick, magnetic tape, magnetic disk, optical disk or semiconductor storage device. A software program, such as the software program 108 (FIG. 1 ) and the Transform Skip Encoding Program 116 (FIG. 1 ) can be stored on one or more of the respective portable computer-readable tangible storage devices 936, read via the respective R/W drive or interface 832 and loaded into the respective hard drive 830.

Each set of internal components 800A,B also includes network adapters or interfaces 836 such as a TCP/IP adapter cards; wireless Wi-Fi interface cards; or 3G, 4G, or 5G wireless interface cards or other wired or wireless communication links. The software program 108 (FIG. 1 ) and the Transform Skip Encoding Program 116 (FIG. 1 ) on the server computer 114 (FIG. 1 ) can be downloaded to the computer 102 (FIG. 1 ) and server computer 114 from an external computer via a network (for example, the Internet, a local area network or other, wide area network) and respective network adapters or interfaces 836. From the network adapters or interfaces 836, the software program 108 and the Transform Skip Encoding Program 116 on the server computer 114 are loaded into the respective hard drive 830. The network may comprise copper wires, optical fibers, wireless transmission, routers, firewalls, switches, gateway computers and/or edge servers.

Each of the sets of external components 900A,B can include a computer display monitor 920, a keyboard 930, and a computer mouse 934. External components 900A,B can also include touch screens, virtual keyboards, touch pads, pointing devices, and other human interface devices. Each of the sets of internal components 800A,B also includes device drivers 840 to interface to computer display monitor 920, keyboard 930 and computer mouse 934. The device drivers 840, R/W drive or interface 832 and network adapter or interface 836 comprise hardware and software (stored in storage device 830 and/or ROM 824).

It is understood in advance that although this disclosure includes a detailed description on cloud computing, implementation of the teachings recited herein are not limited to a cloud computing environment. Rather, some embodiments are capable of being implemented in conjunction with any other type of computing environment now known or later developed.

Cloud computing is a model of service delivery for enabling convenient, on-demand network access to a shared pool of configurable computing resources (e.g. networks, network bandwidth, servers, processing, memory, storage, applications, virtual machines, and services) that can be rapidly provisioned and released with minimal management effort or interaction with a provider of the service. This cloud model may include at least five characteristics, at least three service models, and at least four deployment models.

Characteristics are as Follows:

On-demand self-service: a cloud consumer can unilaterally provision computing capabilities, such as server time and network storage, as needed automatically without requiring human interaction with the service's provider.

Broad network access: capabilities are available over a network and accessed through standard mechanisms that promote use by heterogeneous thin or thick client platforms (e.g., mobile phones, laptops, and PDAs).

Resource pooling: the provider's computing resources are pooled to serve multiple consumers using a multi-tenant model, with different physical and virtual resources dynamically assigned and reassigned according to demand. There is a sense of location independence in that the consumer generally has no control or knowledge over the exact location of the provided resources but may be able to specify location at a higher level of abstraction (e.g., country, state, or datacenter).

Rapid elasticity: capabilities can be rapidly and elastically provisioned, in some cases automatically, to quickly scale out and rapidly released to quickly scale in. To the consumer, the capabilities available for provisioning often appear to be unlimited and can be purchased in any quantity at any time.

Measured service: cloud systems automatically control and optimize resource use by leveraging a metering capability at some level of abstraction appropriate to the type of service (e.g., storage, processing, bandwidth, and active user accounts). Resource usage can be monitored, controlled, and reported providing transparency for both the provider and consumer of the utilized service.

Service Models are as Follows:

Software as a Service (SaaS): the capability provided to the consumer is to use the provider's applications running on a cloud infrastructure. The applications are accessible from various client devices through a thin client interface such as a web browser (e.g., web-based e-mail). The consumer does not manage or control the underlying cloud infrastructure including network, servers, operating systems, storage, or even individual application capabilities, with the possible exception of limited user-specific application configuration settings.

Platform as a Service (PaaS): the capability provided to the consumer is to deploy onto the cloud infrastructure consumer-created or acquired applications created using programming languages and tools supported by the provider. The consumer does not manage or control the underlying cloud infrastructure including networks, servers, operating systems, or storage, but has control over the deployed applications and possibly application hosting environment configurations.

Infrastructure as a Service (IaaS): the capability provided to the consumer is to provision processing, storage, networks, and other fundamental computing resources where the consumer is able to deploy and run arbitrary software, which can include operating systems and applications. The consumer does not manage or control the underlying cloud infrastructure but has control over operating systems, storage, deployed applications, and possibly limited control of select networking components (e.g., host firewalls).

Deployment Models are as Follows:

Private cloud: the cloud infrastructure is operated solely for an organization. It may be managed by the organization or a third party and may exist on-premises or off-premises.

Community cloud: the cloud infrastructure is shared by several organizations and supports a specific community that has shared concerns (e.g., mission, security requirements, policy, and compliance considerations). It may be managed by the organizations or a third party and may exist on-premises or off-premises.

Public cloud: the cloud infrastructure is made available to the general public or a large industry group and is owned by an organization selling cloud services.

Hybrid cloud: the cloud infrastructure is a composition of two or more clouds (private, community, or public) that remain unique entities but are bound together by standardized or proprietary technology that enables data and application portability (e.g., cloud bursting for load-balancing between clouds).

A cloud computing environment is service oriented with a focus on statelessness, low coupling, modularity, and semantic interoperability. At the heart of cloud computing is an infrastructure comprising a network of interconnected nodes.

Referring to FIG. 6 , illustrative cloud computing environment 600 is depicted. As shown, cloud computing environment 600 comprises one or more cloud computing nodes 10 with which local computing devices used by cloud consumers, such as, for example, personal digital assistant (PDA) or cellular telephone 54A, desktop computer 54B, laptop computer 54C, and/or automobile computer system 54N may communicate. Cloud computing nodes 10 may communicate with one another. They may be grouped (not shown) physically or virtually, in one or more networks, such as Private, Community, Public, or Hybrid clouds as described hereinabove, or a combination thereof. This allows cloud computing environment 600 to offer infrastructure, platforms and/or software as services for which a cloud consumer does not need to maintain resources on a local computing device. It is understood that the types of computing devices 54A-N shown in FIG. 6 are intended to be illustrative only and that cloud computing nodes 10 and cloud computing environment 600 can communicate with any type of computerized device over any type of network and/or network addressable connection (e.g., using a web browser).

Referring to FIG. 7 , a set of functional abstraction layers 700 provided by cloud computing environment 600 (FIG. 6 ) is shown. It should be understood in advance that the components, layers, and functions shown in FIG. 7 are intended to be illustrative only and embodiments are not limited thereto. As depicted, the following layers and corresponding functions are provided:

Hardware and software layer 60 includes hardware and software components. Examples of hardware components include: mainframes 61; RISC (Reduced Instruction Set Computer) architecture based servers 62; servers 63; blade servers 64; storage devices 65; and networks and networking components 66. In some embodiments, software components include network application server software 67 and database software 68.

Virtualization layer 70 provides an abstraction layer from which the following examples of virtual entities may be provided: virtual servers 71; virtual storage 72; virtual networks 73, including virtual private networks; virtual applications and operating systems 74; and virtual clients 75.

In one example, management layer 80 may provide the functions described below. Resource provisioning 81 provides dynamic procurement of computing resources and other resources that are utilized to perform tasks within the cloud computing environment. Metering and Pricing 82 provide cost tracking as resources are utilized within the cloud computing environment, and billing or invoicing for consumption of these resources. In one example, these resources may comprise application software licenses. Security provides identity verification for cloud consumers and tasks, as well as protection for data and other resources. User portal 83 provides access to the cloud computing environment for consumers and system administrators. Service level management 84 provides cloud computing resource allocation and management such that required service levels are met. Service Level Agreement (SLA) planning and fulfillment 85 provide pre-arrangement for, and procurement of, cloud computing resources for which a future requirement is anticipated in accordance with an SLA.

Workloads layer 90 provides examples of functionality for which the cloud computing environment may be utilized. Examples of workloads and functions which may be provided from this layer include: mapping and navigation 91; software development and lifecycle management 92; virtual classroom education delivery 93; data analytics processing 94; transaction processing 95; and Transform Skip Encoding 96. Transform Skip Encoding 96 may allow for extended range of Rice parameters used in residual coding of video data.

Some embodiments may relate to a system, a method, and/or a computer readable medium at any possible technical detail level of integration. The computer readable medium may include a computer-readable non-transitory storage medium (or media) having computer readable program instructions thereon for causing a processor to carry out operations.

The computer readable storage medium can be a tangible device that can retain and store instructions for use by an instruction execution device. The computer readable storage medium may be, for example, but is not limited to, an electronic storage device, a magnetic storage device, an optical storage device, an electromagnetic storage device, a semiconductor storage device, or any suitable combination of the foregoing. A non-exhaustive list of more specific examples of the computer readable storage medium includes the following: a portable computer diskette, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or Flash memory), a static random access memory (SRAM), a portable compact disc read-only memory (CD-ROM), a digital versatile disk (DVD), a memory stick, a floppy disk, a mechanically encoded device such as punch-cards or raised structures in a groove having instructions recorded thereon, and any suitable combination of the foregoing. A computer readable storage medium, as used herein, is not to be construed as being transitory signals per se, such as radio waves or other freely propagating electromagnetic waves, electromagnetic waves propagating through a waveguide or other transmission media (e.g., light pulses passing through a fiber-optic cable), or electrical signals transmitted through a wire.

Computer readable program instructions described herein can be downloaded to respective computing/processing devices from a computer readable storage medium or to an external computer or external storage device via a network, for example, the Internet, a local area network, a wide area network and/or a wireless network. The network may comprise copper transmission cables, optical transmission fibers, wireless transmission, routers, firewalls, switches, gateway computers and/or edge servers. A network adapter card or network interface in each computing/processing device receives computer readable program instructions from the network and forwards the computer readable program instructions for storage in a computer readable storage medium within the respective computing/processing device.

Computer readable program code/instructions for carrying out operations may be assembler instructions, instruction-set-architecture (ISA) instructions, machine instructions, machine dependent instructions, microcode, firmware instructions, state-setting data, configuration data for integrated circuitry, or either source code or object code written in any combination of one or more programming languages, including an object oriented programming language such as Smalltalk, C++, or the like, and procedural programming languages, such as the “C” programming language or similar programming languages. The computer readable program instructions may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the latter scenario, the remote computer may be connected to the user's computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or the connection may be made to an external computer (for example, through the Internet using an Internet Service Provider). In some embodiments, electronic circuitry including, for example, programmable logic circuitry, field-programmable gate arrays (FPGA), or programmable logic arrays (PLA) may execute the computer readable program instructions by utilizing state information of the computer readable program instructions to personalize the electronic circuitry, in order to perform aspects or operations.

These computer readable program instructions may be provided to a processor of a general purpose computer, special purpose computer, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks. These computer readable program instructions may also be stored in a computer readable storage medium that can direct a computer, a programmable data processing apparatus, and/or other devices to function in a particular manner, such that the computer readable storage medium having instructions stored therein comprises an article of manufacture including instructions which implement aspects of the function/act specified in the flowchart and/or block diagram block or blocks.

The computer readable program instructions may also be loaded onto a computer, other programmable data processing apparatus, or other device to cause a series of operational steps to be performed on the computer, other programmable apparatus or other device to produce a computer implemented process, such that the instructions which execute on the computer, other programmable apparatus, or other device implement the functions/acts specified in the flowchart and/or block diagram block or blocks.

The flowchart and block diagrams in the Figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods, and computer readable media according to various embodiments. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of instructions, which comprises one or more executable instructions for implementing the specified logical function(s). The method, computer system, and computer readable medium may include additional blocks, fewer blocks, different blocks, or differently arranged blocks than those depicted in the Figures. In some alternative implementations, the functions noted in the blocks may occur out of the order noted in the Figures. For example, two blocks shown in succession may, in fact, be executed concurrently or substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems that perform the specified functions or acts or carry out combinations of special purpose hardware and computer instructions.

It will be apparent that systems and/or methods, described herein, may be implemented in different forms of hardware, firmware, or a combination of hardware and software. The actual specialized control hardware or software code used to implement these systems and/or methods is not limiting of the implementations. Thus, the operation and behavior of the systems and/or methods were described herein without reference to specific software code—it being understood that software and hardware may be designed to implement the systems and/or methods based on the description herein.

No element, act, or instruction used herein should be construed as critical or essential unless explicitly described as such. Also, as used herein, the articles “a” and “an” are intended to include one or more items, and may be used interchangeably with “one or more.” Furthermore, as used herein, the term “set” is intended to include one or more items (e.g., related items, unrelated items, a combination of related and unrelated items, etc.), and may be used interchangeably with “one or more.” Where only one item is intended, the term “one” or similar language is used. Also, as used herein, the terms “has,” “have,” “having,” or the like are intended to be open-ended terms. Further, the phrase “based on” is intended to mean “based, at least in part, on” unless explicitly stated otherwise.

The descriptions of the various aspects and embodiments have been presented for purposes of illustration, but are not intended to be exhaustive or limited to the embodiments disclosed. Even though combinations of features are recited in the claims and/or disclosed in the specification, these combinations are not intended to limit the disclosure of possible implementations. In fact, many of these features may be combined in ways not specifically recited in the claims and/or disclosed in the specification. Although each dependent claim listed below may directly depend on only one claim, the disclosure of possible implementations includes each dependent claim in combination with every other claim in the claim set. Many modifications and variations will be apparent to those of ordinary skill in the art without departing from the scope of the described embodiments. The terminology used herein was chosen to best explain the principles of the embodiments, the practical application or technical improvement over technologies found in the marketplace, or to enable others of ordinary skill in the art to understand the embodiments disclosed herein. 

What is claimed is:
 1. A method of coding video data, executable by a processor, comprising: receiving video data comprising a reference frame and residual blocks; identifying transform coefficients associated with the residual blocks; and encoding the video data corresponding to the residual blocks based on the transform coefficients and a parameterization value, wherein the parameterization value is based on an addition of a plurality of relational operations, and wherein the parameterization value is determined without a lookup table.
 2. The method of claim 1, wherein the addition of the plurality of relational operations is represented as (sum>6)+(sum>13)+(sum>27), wherein a relational operator (>) may yield 1 if the relation is true and 0 if the relation is false.
 3. The method of claim 2, wherein the sum is based on a plurality of maximum values from among absolute values associated with neighboring residual blocks from among the residual blocks.
 4. The method of claim 1, wherein the video data is encoded based on a Rice parameter associated with the residual blocks.
 5. The method of claim 3, wherein the sum is based on a function ƒ(x) represented as follows: $\begin{matrix} {{{f(x)} = {\beta_{0} + {\sum\limits_{i = 1}^{n}{\beta_{i}{H_{a_{i - 1}}(x)}}}}},} &  \end{matrix}$ where x represents the sum, n represents a real number larger than 1, a represents an integer, β₀=a₀, β_(i)=a_(i)−a_(i-1), and H_(a)(x) is a unit-step function of x with a, and i is an index.
 6. The method of claim 3, wherein the sum is based on a function ƒ(x) represented as follows: $\begin{matrix} {{{f(x)} = {\sum\limits_{i = 1}^{n}{H_{a_{i - 1}}(x)}}},} &  \end{matrix}$ where x represents the sum, n represents a real number larger than 1, a represents an integer, and H_(a)(x) is a unit-step function of x with a, and i is an index.
 7. The method of claim 5, wherein the unit-step function may be implemented as one of (x≥a) or (x>(a−1)).
 8. A computer system for video coding, the computer system comprising: one or more computer-readable non-transitory storage media configured to store computer program code; and one or more computer processors configured to access said computer program code and operate as instructed by said computer program code, said computer program code including: receiving code configured to cause the one or more computer processors to receive video data comprising a reference frame and residual blocks; identifying code configured to cause the one or more computer processors to identify transform coefficients associated with the residual blocks; and encoding code configured to cause the one or more computer processors to encode the video data corresponding to the residual blocks, based on the transform coefficients and a parameterization value, wherein the parameterization value is based on an addition of a plurality of relational operations, and wherein the parameterization value is determined without a lookup table.
 9. The computer system of claim 8, wherein the addition of the plurality of relational operations is represented as (sum>6)+(sum>13)+(sum>27), wherein a relational operator (>) may yield 1 if the relation is true and 0 if the relation is false.
 10. The computer system of claim 9, wherein the sum is based on a plurality of maximum values from among absolute values associated with neighboring residual blocks from among the residual blocks.
 11. The computer system of claim 8, wherein the video data is encoded based on a Rice parameter associated with the residual blocks.
 12. The computer system of claim 10, wherein the sum is based on a function ƒ(x) represented as follows: $\begin{matrix} {{{f(x)} = {\beta_{0} + {\sum\limits_{i = 1}^{n}{\beta_{i}{H_{a_{i - 1}}(x)}}}}},} &  \end{matrix}$ where x represents the sum, n represents a real number larger than 1, a represents an integer, β₀=a₀, β_(i)=a_(i)−a_(i-1), and H_(a)(x) is a unit-step function of x with a, and i is an index.
 13. The computer system of claim 10, wherein the sum is based on a function ƒ(x) represented as follows: $\begin{matrix} {{{f(x)} = {\sum\limits_{i = 1}^{n}{H_{a_{i - 1}}(x)}}},} &  \end{matrix}$ where x represents the sum, n represents a real number larger than 1, a represents an integer, and H_(a)(x) is a unit-step function of x with a, and i is an index.
 14. The computer system of claim 12, wherein the unit-step function may be implemented as one of (x≥a) or (x>(a−1)).
 15. A non-transitory computer readable medium having stored thereon a computer program for video coding, the computer program configured to cause one or more computer processors to: receive video data comprising a reference frame and residual blocks; identify transform coefficients associated with the residual blocks; and encode the video data corresponding to the residual blocks based on the transform coefficients and a parameterization value, wherein the parameterization value is based on an addition of a plurality of relational operations, and wherein the parameterization value is determined without a lookup table.
 16. The computer readable medium of claim 15, wherein the addition of the plurality of relational operations is represented as (sum>6)+(sum>13)+(sum>27), wherein a relational operator (>) may yield 1 if the relation is true and 0 if the relation is false.
 17. The computer readable medium of claim 16, wherein the sum is based on a plurality of maximum values from among absolute values associated with neighboring residual blocks from among the residual blocks.
 18. The computer readable medium of claim 17, wherein the sum is based on a function ƒ(x) represented as follows: $\begin{matrix} {{{f(x)} = {\beta_{0} + {\sum\limits_{i = 1}^{n}{\beta_{i}{H_{a_{i - 1}}(x)}}}}},} &  \end{matrix}$ where x represents the sum, n represents a real number larger than 1, a represents an integer, β₀=a₀, β_(i)=a_(i)−a_(i-1), and H_(a)(x) is a unit-step function of x with a, and i is an index.
 19. The computer readable medium of claim 17, wherein the sum is based on a function ƒ(x) represented as follows: $\begin{matrix} {{{f(x)} = {\sum\limits_{i = 1}^{n}{H_{a_{i - 1}}(x)}}},} &  \end{matrix}$ where x represents the sum, n represents a real number larger than 1, a represents an integer, and H_(a)(x) is a unit-step function of x with a, and i is an index.
 20. The computer readable medium of claim 18, wherein the unit-step function may be implemented as one of (x≥a) or (x>(a−1)). 